A Stochastic Search Approach to Grammar Induction
نویسندگان
چکیده
This paper describes a new sampling-based heuristic for tree search named SAGE and presents an analysis of its performance on the problem of grammar induction. This last work has been inspired by the Abbadingo DFA learning competition [14] which took place between Mars and November 1997. SAGE ended up as one of the two winners in that competition. The second winning algorithm, rst proposed by Rodney Price, implements a new evidence-driven heuristic for state merging. Our own version of this heuristic is also described in this paper and compared to SAGE.
منابع مشابه
Stochastic Context-Free Grammar Induction with a Genetic Algorithm Using Local Search
We have previously used grammars as a formalism to structure a GA's search for program called sorting networks (SNets) [KBW95]. In this paper we restrict ourselves to stochastic context-free grammars which, while more analytically tracxtable than our SNet grammars, are more difficult than others previously considered by the GA community. In our approach: production rules of a grammar are encode...
متن کاملA Sampling-Based Heuristic for Tree Search Applied to Grammar Induction
In the eld of Operation Research and Arti cial Intelligence, several stochastic search algorithms have been designed based on the theory of global random search (Zhigljavsky 1991). Basically, those techniques iteratively sample the search space with respect to a probability distribution which is updated according to the result of previous samples and some prede ned strategy. Genetic Algorithms ...
متن کاملUnsupervised Grammar Induction with Depth-bounded PCFG
There has been recent interest in applying cognitively or empirically motivated bounds on recursion depth to limit the search space of grammar induction models (Ponvert et al., 2011; Noji and Johnson, 2016; Shain et al., 2016). This work extends this depth-bounding approach to probabilistic context-free grammar induction (DB-PCFG), which has a smaller parameter space than hierarchical sequence ...
متن کاملA stochastic network design of bulky waste recycling – a hybrid harmony search approach based on sample approximation
Facing supply uncertainty of bulky wastes, the capacitated multi-product stochastic network design model for bulky waste recycling is proposed in this paper. The objective of this model is to minimize the first-stage total fixed costs and the expected value of the second-stage variable costs. The possibility of operation costs and transportation costs for bulky waste recycling is considered ...
متن کاملLearning Classifier System Approach to Natural Language Grammar Induction
This paper describes an evolutionary approach to the problem of inferring non-stochastic context-free grammar (CFG) from natural language (NL) corpora. The approach employs Grammar-based Classifier System (GCS). GCS is a new version of Learning Classifier Systems in which classifiers are represented by CFG in Chomsky Normal Form. GCS has been tested on the NL corpora, and it provided comparable...
متن کامل